Analysis of Facility Location Using Ordered Rectilinear Distance in Regular Point Patterns
نویسنده
چکیده
This paper deals with the kth nearest rectilinear distance of two regular point patterns: square and diamond lattices. The probability density functions of the kth nearest rectilinear distance are theoretically derived for k = 1, 2, . . . , 8. Upper and lower bounds of the kth nearest distance are also derived. As an application of the kth nearest distance, we consider a facility location problem with closing of facilities. The objective is to find the best configuration of facilities that minimizes the average rectilinear distance from residents to their nearest open facility when some existing facilities are closed. Assuming that facilities are closed independently and at random, we show that the diamond lattice is the best if at least 73% of facilities are open.
منابع مشابه
Rectilinear Distance in Rotated Regular Point Patterns
This paper examines the relationship between road directions and the rectilinear distance in regular point patterns. We derive the distributions of the rectilinear distances to the nearest and the second nearest points in rotated regular point patterns. These distributions demonstrate that road directions significantly affect the rectilinear distances. As an application of the nearest and the s...
متن کاملA Multi-Period 1-Center Location Problem in the Presence of a Probabilistic Line Barrier
This paper investigates a multi-period rectilinear distance 1-center location problem considering a line-shaped barrier, in which the starting point of the barrier follows the uniform distribution function. In addition, the existing points are sensitive to demands and locations. The purpose of the presented model is to minimize the maximum barrier distance from the new facility to the existing ...
متن کاملAn Approximation for the Kth Nearest Distance and Its Application to Locational Analysis
In this paper, we provide a simple approximation for the distance from an arbitrary location to the kth nearest point. Distance is measured as the Euclidean and the rectilinear distances on a continuous plane. The approximation demonstrates that the kth nearest distance is proportional to the square root of k and inversely proportional to the square root of the density of points. The accuracy o...
متن کاملDistribution of the Difference between Distances to the First and the Second Nearest Facilities
This paper derives the distribution of the difference between the distances to the first and the second nearest facilities. Facilities are represented as points of regular and random patterns, and distance is measured as Euclidean and rectilinear distances on a continuous plane. Since the difference between the distances is regarded as the additional travel distance of customers when the neares...
متن کاملUsing tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance
We consider a constrained minimax single-facility location problem with addends on the plane with rectilinear distance. The problem is first formulated in a standard form, and then represented in terms of tropical mathematics as a constrained optimization problem. We apply methods and results of tropical optimization to obtain direct, explicit solutions to the optimization problem. The results ...
متن کامل